On a Representation of the Matching Polytope Via Semidefinite Liftings
نویسندگان
چکیده
We consider the relaxation of the matching polytope defined by the non-negativity and degree constraints. We prove that given an undirected graph on n nodes and the corresponding relaxation of the matching polytope, n /2 iterations of the Lovász-Schrijver semidefinite lifting procedure are needed to obtain the matching polytope, in the worst case. We show that n /2 iterations of the procedure always suffice.
منابع مشابه
Approximation of the Stability Number of a Graph via Copositive Programming
Lovász and Schrijver showed how to formulate increasingly tight approximations of the stable set polytope of a graph by solving semidefinite programs (SDP’s) of increasing size (lift-and-project method). In this talk we present a similar idea. We show how the stability number can be computed as the solution of a conic linear program (LP) over the cone of copositive matrices. Subsequently, we sh...
متن کاملA remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملGeneralized Gauss inequalities via semidefinite programming
A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming. However, this Chebyshev-type bound tends to be overly conservative since it is determined by a discrete worst-case distribution. In this paper we obtain a less pessimistic Gauss-type bo...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملTighter Linear and Semidefinite Relaxations for Max-cut Based on the Lovász–schrijver Lift-and-project Procedure∗
We study how the lift-and-project method introduced by Lovász and Schrijver [SIAM J. Optim., 1 (1991), pp. 166–190] applies to the cut polytope. We show that the cut polytope of a graph can be found in k iterations if there exist k edges whose contraction produces a graph with no K5-minor. Therefore, for a graph G with n ≥ 4 nodes with stability number α(G), n − 4 iterations suffice instead of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Oper. Res.
دوره 24 شماره
صفحات -
تاریخ انتشار 1999